Distance labeling schemes for well-separated graph classes
نویسندگان
چکیده
منابع مشابه
Distance Labeling Schemes for Trees
We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoille et al., J. Alg., 2004] and an upper bound by Peleg [Peleg, J. Graph Theory, 2000] establish that l...
متن کاملApproximate Distance Labeling Schemes
We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u, v of G can be approximated efficiently (in constant time) by merely inspecting the labels of u and v, without using any other information. We develop such constant approximate distance labeling schemes for the classes of trees, bounded treewidth graphs, p...
متن کاملOptimal Distance Labeling Schemes for Trees
Labeling schemes seek to assign a short label to each node in a network, so that a function on two nodes (such as distance or adjacency) can be computed by examining their labels alone. For the particular case of trees, following a long line of research, optimal bounds (up to low order terms) were recently obtained for adjacency labeling [FOCS ’15], nearest common ancestor labeling [SODA ’14], ...
متن کاملSimple labeling schemes for graph connectivity
Let G = (V,E) be an undirected graph and let S ⊆ V . The S-connectivity SG(u, v) of a pair of nodes u, v in G is the maximum number of uv-paths that no two of them have an edge or a node in S ∖ {u, v} in common. Edge-connectivity is the case S = ∅ and node-connectivity is the case S = V . Given a graph G = (V,E), an integer k, a subset T ⊆ V of terminals, and S ⊆ V , we consider the problem of ...
متن کاملOptimal Distance Labeling for Interval Graphs and Related Graph Families
A distance labeling scheme is a distributed graph representation that assigns labels to the vertices and enables answering distance queries between any pair (x, y) of vertices by using only the labels of x and y. This paper presents an optimal distance labeling scheme with labels of O(logn) bits for the n-vertex interval graphs family. It improves by log n factor the best known upper bound of [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.03.005